Algorithm for Kekule Structure Counting in Fullerene Molecules.
نویسندگان
چکیده
منابع مشابه
Polygonal tiling of some surfaces containing fullerene molecules
A tiling of a surface is a decomposition of the surface into pieces, i.e. tiles, which cover it without gaps or overlaps. In this paper some special polygonal tiling of sphere, ellipsoid, cylinder, and torus as the most abundant shapes of fullerenes are investigated.
متن کاملSome relations between Kekule structure and Morgan-Voyce polynomials
In this paper, Kekule structures of benzenoid chains are considered. It has been shown that the coefficients of a B_n (x) Morgan-Voyce polynomial equal to the number of k-matchings (m(G,k)) of a path graph which has N=2n+1 points. Furtermore, two relations are obtained between regularly zig-zag nonbranched catacondensed benzenid chains and Morgan-Voyce polynomials and between regularly zig-zag ...
متن کاملCalculating the Determinant of the Adjacency Matrix and Counting Kekule Structures in Circulenes
a Institute of Physical Chemistry, Attila Jözsef University, Szeged, Hungary; on leave from Faculty of Science, University of Kragujevac b Institute of Mathematics, Academia Sinica, Taipei, Taiwan, R.O.C. c Department of Chemistry, National Chung-Cheng University, Chia-Yi, Taiwan, R.O.C. d Department of Information Sciences, Ochanomizu University, Tokyo, Japan e Division of Physical Chemistry, ...
متن کاملTransport of fullerene molecules along graphene nanoribbons
We study the motion of C₆₀ fullerene molecules and short-length carbon nanotubes on graphene nanoribbons. We reveal that the character of the motion of C₆₀ depends on temperature: for T < 150 K the main type of motion is sliding along the surface, but for higher temperatures the sliding is replaced by rocking and rolling. Modeling of the buckyball with an included metal ion demonstrates that th...
متن کاملFinding Fullerene Patches in Polynomial Time I: Counting Hexagonal Patches
A hexagonal patch is a plane graph in which inner faces have length 6, inner vertices have degree 3, and boundary vertices have degree 2 or 3. We consider the following counting problem: given a sequence of twos and threes, how many hexagonal patches exist with this degree sequence along the outer face? This problem is motivated by the study of benzenoid hydrocarbons and fullerenes in computati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Chemical Software
سال: 2001
ISSN: 0918-0761
DOI: 10.2477/jchemsoft.7.99